package jjn.round2;

/**
 * @author Jiang Jining
 * @since 2023-05-17 23:27
 */
public class LeetCode2446_DetermineIfTwoEventsHaveConflict {
    public boolean haveConflict(String[] event1, String[] event2) {
        String firstStart = event1[0];
        String firstEnd = event1[1];
        String secondStart = event2[0];
        String secondEnd = event2[1];
        if (firstEnd.compareTo(secondStart) < 0) {
            return false;
        }
        if (firstStart.compareTo(secondEnd) > 0) {
            return false;
        }
        return true;
    }
}
